A Modular Implementation of Data Structures in Bulk-Synchronous Parallel ML

Bulk Synchronous Parallel ML: Modular Implementation and Performance Prediction

BSML is a library for parallel programming with the functional language Objective Caml. It is based on an extension of the λcalculus by parallel operations on a parallel data structure named parallel vector. The execution time can be estimated, dead-locks and indeterminism are avoided. Programs are written as usual functional programs (in Objective Caml) but using a small set of additional func...

Implementation of the Parallel Superposition in Bulk-Synchronous Parallel ML

Bulk-Synchronous Parallel ML (BSML) is a functional dataparallel language to code Bulk-Synchronous Parallel (BSP) algorithms. It allows an estimation of execution time, avoids deadlocks and nondeterminism. This paper presents the implementation of a new primitive for BSML which can express divide-and-conquer algorithms.

New implementation of a parallel composition primitive for a functionnal BSP language

Bulk-Synchronous Parallel ML (BSML) is a ML based language to code Bulk-Synchronous Parallel (BSP)algorithms. It allows an estimation of execution time, avoids deadlocks and non-determinism. BSML proposes anextension of ML programming with parallel primitives on a parallel data structure called parallel vector. One ofthese primitives is dedicated to express at most divide-and-conque...

Bulk Synchronous Parallel ML: Semantics and Implementation of the Parallel Juxtaposition

BSP Functional Programming: Examples of a Cost Based Methodology

Bulk-Synchronous Parallel ML (BSML) is a functional dataparallel language for the implementation of Bulk-Synchronous Parallel (BSP) algorithms. It makes an estimation of the execution time (cost) possible. This paper presents some general examples of BSML programs and a comparison of their predicted costs with the measured execution time on a parallel machine.